Examples comparing Importance Sampling and the Metropolis algorithm
نویسنده
چکیده
Importance sampling, particularly sequential and adaptive importance sampling, have emerged as competitive simulation techniques to Markov–chain Monte–Carlo techniques. We compare importance sampling and the Metropolis algorithm as two ways of changing the output of a Markov chain to get a different stationary distribution.
منابع مشابه
Adaptive Mixture of Student-t Distributions as a Flexible Candidate Distribution for Efficient Simulation
This paper presents the R package AdMit which provides flexible functions to approximate a certain target distribution and it provides an efficient sample of random draws from it, given only a kernel of the target density function. The core algorithm consists of the function AdMit which fits an adaptive mixture of Student-t distributions to the density of interest via its kernel function. Then,...
متن کاملApproximating Bayes Estimates by Means of the Tierney Kadane, Importance Sampling and Metropolis-Hastings within Gibbs Methods in the Poisson-Exponential Distribution: A Comparative Study
Here, we work on the problem of point estimation of the parameters of the Poisson-exponential distribution through the Bayesian and maximum likelihood methods based on complete samples. The point Bayes estimates under the symmetric squared error loss (SEL) function are approximated using three methods, namely the Tierney Kadane approximation method, the importance sampling method and the Metrop...
متن کاملADAPTIVE RADIAL-BASED DIRECTION SAMPLING: Some flexible and robust Monte Carlo integration methods
Adaptive radial-based direction sampling (ARDS) algorithms are specified for Bayesian analysis of models with nonelliptical, possibly, multimodal target distributions. A key step is a radial-based transformation to directions and distances. After the transformations a Metropolis-Hastings method or, alternatively, an importance sampling method is applied to evaluate generated directions. Next, d...
متن کاملIterative and Non-iterative Simulation Algorithms
The Gibbs sampler, Metropolis’ algorithm, and similar iterative simulation methods are related to rejection sampling and importance sampling, two methods which have been traditionally thought of as non-iterative. We explore connections between importance sampling, iterative simulation, and importance-weighted resampling (SIR), and present new algorithms that combine aspects of importance sampli...
متن کاملSlice Gibbs Sampling for Simulation Based Fitting of Spatial Data Models
An auxiliary variable method which we refer to as a slice Gibbs sampler is shown to provide an attractive simulation-based model tting strategy for tting Bayesian models under proper priors. Though broadly applicable, we illustrate in the context of tting spatial models for geo-referenced or point source data. Spatial modeling within a Bayesian framework ooers inferential advantages and the sli...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005